Algorithms for Even-sided Selfagons
نویسنده
چکیده
Abstract. Let P ∈ R be a lattice polytope. Then P is smooth if for each vertex v ∈ P , {wi − v} forms part of a Z-basis for Z , where wi is the first lattice vector along an edge incident at v. We say P has lattice-free edges if the only lattice points on the edges of P are the vertices of P . We present two new algorithms for constructing smooth lattice polytopes with lattice-free edges and an even number of edges. The equivalence of one of the algorithms to a previous algorithm is also proved using the inner normal fans of the polytopes.
منابع مشابه
Comparison between Frequentist Test and Bayesian Test to Variance Normal in the Presence of Nuisance Parameter: One-sided and Two-sided Hypothesis
This article is concerned with the comparison P-value and Bayesian measure for the variance of Normal distribution with mean as nuisance paramete. Firstly, the P-value of null hypothesis is compared with the posterior probability when we used a fixed prior distribution and the sample size increases. In second stage the P-value is compared with the lower bound of posterior probability when the ...
متن کاملComparison of particle swarm optimization and tabu search algorithms for portfolio selection problem
Using Metaheuristics models and Evolutionary Algorithms for solving portfolio problem has been considered in recent years.In this study, by using particles swarm optimization and tabu search algorithms we optimized two-sided risk measures . A standard exact penalty function transforms the considered portfolio selection problem into an equivalent unconstrained minimization problem. And in final...
متن کاملStreaming Algorithms with One-Sided Estimation
We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of the function being computed, and with high probability, the estimate is not too far from the true answer. We also study algorithms which always provide underestimates. We also give lower bounds for several one-sided estimators th...
متن کاملA Multi-objective Mixed Model Two-sided Assembly Line Sequencing Problem in a Make –To- Order Environment with Customer Order Prioritization
Mixed model two-sided assembly lines (MM2SAL) are applied to assemble large product models, which is produced in high-volume. So, the sequence planning of products to reduce cost and increase productivity in this kind of lines is imperative. The presented problem is tackled in two steps. In step 1, a framework is developed to select and prioritize customer orders under the finite capacity of th...
متن کاملSequential and parallel algorithms for low-crossing graph drawing
The oneand two-sided bipartite graph drawing problem alms to find a layout of a bipartite graph, with vertices of the two parts placed on parallel imaginary lines, that has the minimum number of edge-crossings. Vertices of one part are in fixed positions for the one-sided problem, whereas all vertices are free to move along their lines in the two-sided version. Many different heuristics exist f...
متن کامل